#include <bits/stdc++.h>
using namespace std;

class Solution
{
public:
    int main()
    {
        int low, high;
        cin >> low >> high;
        for(int digit = 0; digit <= 9; ++digit)
        {
            cout << getDigitFreq(high, digit) - getDigitFreq(low - 1, digit) << " ";
        }
        return 0;
    }

    // 参见 入门3 P1980 计数问题，以logn的时间获取1到n中digit的出现次数
    int getDigitFreq(int n, int digit)
    {     
        long long mask = 1;
        int count = 0;
        while (mask <= n)
        {
            int bit = n / mask % 10;
            int left = n / mask / 10;
            int right = n % mask;
            if (digit != 0)
            {
                if (bit < digit)
                {
                    count += left * mask;
                }
                else if (bit == digit)
                {
                    count += left * mask + right + 1;
                }
                else 
                {
                    count += (left + 1) * mask;
                }
            }
            else
            {
                if (bit == 0)
                {
                    count += (left - 1) * mask + right + 1;
                }
                else
                {
                    count += left * mask;
                }
            }
            mask *= 10;
        }
        return count;
    }
};

#ifndef __LOCAL_TEST__
int main()
{
    return Solution().main();
}
#endif